Simplifying a test while preserving its desirable behavior is
useful in software development. It makes test execution more
efficient, eases communication between developers, and locates
revealed defects faster.

We argued that existing approaches are fundamentally insufficient
for test simplification. To provide a more general solution, we
introduced and modelled the problem of \textit{semantic test
simplification}, proved its NP-hardness, and proposed a simple but
effective algorithm, \SimpleTest, that often yields the optimal
solution. We showed the effectiveness of \SimpleTest through a set
of empirical evaluations. \SimpleTest reduced as much as xxx\% of
the test size for xxx real-world programs, compared to xxx\% by
the existing approaches~\cite{Lei:2005, Leitner:2007}.  We
further applied \SimpleTest to the application domain of automated
debugging, and demonstrated its usefulness in improving two
existing techniques.

%As our future work,

The source code of \SimpleTest is integrated with the
\tool{Randoop} automated testing tool, and is publicly available
at: \url{http://code.google.com/p/randoop/}
